Graphs with $1$-factors
نویسندگان
چکیده
منابع مشابه
Graphs with 1-factors
In this paper it is shown that if G is a connected graph of order 2n (n> 1) not containing a 1-factor, then for each k, Kk^n, there exists an induced, connected subgraph of order 2k which also fails to possess a 1-factor. Several other sufficient conditions for a graph to contain a 1-factor are presented. In particular, it is seen that the connected even order line graphs and total graphs alway...
متن کاملElementary graphs with respect to (1, f)-odd factors
This note concerns the (1, f)-odd subgraph problem, i.e. we are given an undirected graph G and an odd value function f : V (G) → N, and our goal is to find a spanning subgraph F of G with degF ≤ f minimizing the number of even degree vertices. First we prove a Gallai–Edmonds type structure theorem and some other known results on the (1, f)-odd subgraph problem, using an easy reduction to the m...
متن کاملGraphs with the maximum or minimum number of 1-factors
Recently Alon and Friedland have shown that graphs which are the union of complete regular bipartite graphs have the maximum number of 1-factors over all graphs with the same degree sequence. We identify two families of graphs that have the maximum number of 1-factors over all graphs with the same number of vertices and edges: the almost regular graphs which are unions of complete regular bipar...
متن کاملCounting 1-Factors in Regular Bipartite Graphs
perfect matchings. (A perfect matching or 1-factor is a set of disjoint edges covering all vertices.) This generalizes a result of Voorhoeve [11] for the case k = 3, stating that any 3-regular bipartite graph with 2n vertices has at least ( 4 3) n perfect matchings. The base in (1) is best possible for any k: let αk be the largest real number such that any k-regular bipartite graph with 2n vert...
متن کاملThe 1-factors of Oriented Graphs
1. Introduction. A graph G consists of a set 7 of elements called vertices together with a set E of elements called edges, the two sets having no element in common. With each edge there are associated either one or two vertices called its ends. In this paper we consider only graphs in which each edge has two distinct ends. We call such a graph oriented if one end of each edge is distinguished a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1974
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1974-0323648-6